Impossibility and Possibility Theorems for Social Choice Functions on Incomplete Preference Profiles
نویسندگان
چکیده
We study the existence and properties of social choice functions when each individual’s preference order is incomplete: each individual expresses his/her preference on his/her alternative set that is a subset of the whole set of alternatives. We define the strategy-proofness and show that the strategy-proofness is incompatible with nondictatorship. In addition, we weaken the definition of the strategy-proofness as well as the dictator, and show the existence of a social choice function with eligible properties.
منابع مشابه
Arrow theorems in the fuzzy setting
Throughout this paper, our main idea is to analyze the Arrovian approach in a fuzzy context, paying attention to different extensions of the classical Arrow's model arising in mathematical Social Choice to aggregate preferences that the agents define on a set of alternatives. There is a wide set of extensions. Some of them give rise to an impossibility theorem as in the Arrovian classical mod...
متن کاملProgramming social choice in logic: some basic experimental results when profiles are restricted
Social choice theory argues mathematical models and their logical consequences for group decision making based on individuals’ preference orderings axiomatically. The most basic results have been proved in this field are two impossibility results for group decision making. Arrow’s general (im)possibility theorem for preference aggregation procedures, i.e., there is no nondictatorial social welf...
متن کاملAutomated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects
We present a method for using standard techniques from satisfiability checking to automatically verify and discover theorems in an area of economic theory known as ranking sets of objects. The key question in this area, which has important applications in social choice theory and decision making under uncertainty, is how to extend an agent’s preferences over a number of objects to a preference ...
متن کاملFirst-Order Logic Formalisation of Impossibility Theorems in Preference Aggregation
In preference aggregation a set of individuals express preferences over a set of alternatives, and these preferences have to be aggregated into a collective preference. When preferences are represented as orders, aggregation procedures are called social welfare functions. Classical results in social choice theory state that it is impossible to aggregate the preferences of a set of individuals u...
متن کاملSocial aggregators
This paper proposes a general framework for analyzing a class of functions called social aggregators, which map profiles of linear orders to a set of binary relations. This class of aggregators includes aggregators that yield a preference relation (social welfare functions) and those which yield a choice of an alternative (social choice functions). Equipped with this framework, I identify a pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005